Series–parallel languages and the bounded-width property
نویسندگان
چکیده
منابع مشابه
Series-parallel languages and the bounded-width property
automates des langages de mots habituels, aux langages d'ensembles par-tiellement ordonn es s erie-parall eles, ou sp-langages. Nous utilisons les pro-pri et es alg ebriques de l'ensemble des ensembles s erie-parall eles pour etudier une notion de reconnaissabilit e bas ee sur les congruences d'indice ni, et une notion de r egularit e bas ee sur une nouvelle classe d'automates, appel es automat...
متن کاملSeries-parallel Languages and the Bounded-width Property 1
automates des langages de mots habituels, aux langages d'ensembles par-tiellement ordonn es s erie-parall eles, ou sp-langages. Nous utilisons les pro-pri et es alg ebriques de l'ensemble des ensembles s erie-parall eles pour etudier une notion de reconnaissabilit e bas ee sur les congruences d'indice ni, et une notion de r egularit e bas ee sur une nouvelle classe d'automates, appel es automat...
متن کاملThe Bounded Tree-Width Problem of Context-Free Graph Languages
We show that the following (equivalent) problems are P-complete: 1. Does a given connuent NCE graph grammar only generate graphs of bounded tree-width? and 2. is the graph language generated by a given connuent NCE graph grammar an HR language? This settles the complexity of these important problems on graph grammars .
متن کاملBounded Width Problems and Algebras
Let A be finite relational structure of finite type, and let CSP (A) denote the following decision problem: if I is a given structure of the same type as A, is there a homomorphism from I to A ? To each relational structure A is associated naturally an algebra A whose structure determines the complexity of the associated decision problem. We investigate those finite algebras arising from CSP’s ...
متن کاملBounded relational width
We prove that CSP(A) for an idempotent algebra A has bounded relational width if and only if var(A) omits the unary and affine types. If it has bounded relational width it has relational width at most 3. The problem, given a relational structure A, decide if CSP(A) has bounded relational width (equivalently, if the variety generated by the corresponding algebra omits the Boolean and affine type...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00031-1